A Basis-Kernel Representation of Orthogonal Matrices
نویسندگان
چکیده
In this paper we introduce a new representation of orthogonal matrices. We show that any orthogonal matrix can be represented in the form Q = I ? Y SY T , which we call the basis-kernel representation of Q. We show that the kernel S can be chosen to be triangular and show how the familiar representation of an orthogonal matrix as a product of Householder matrices can be directly derived from a representation with triangular kernel. We also show that there exists an, in some sense, minimal orthogonal transformation for solving the block elimination problem. We explore how the basis Y determines the subspaces that Q acts on in a nontrivial fashion, and how S determines the way Q acts on this subspace. We derive a canonical representation that explicitly shows how Q partitions R n into three invariant subspaces in which it acts as the identity, a reeector, and a rotator, respectively. We also derive a generalized Cayley representation for arbitrary orthogonal matrices, which illuminates the degrees of freedom we have in choosing orthogonal matrices acting on a predetermined subspace.
منابع مشابه
Composite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملComparison of the Gamma kernel and the orthogonal series methods of density estimation
The standard kernel density estimator suffers from a boundary bias issue for probability density function of distributions on the positive real line. The Gamma kernel estimators and orthogonal series estimators are two alternatives which are free of boundary bias. In this paper, a simulation study is conducted to compare small-sample performance of the Gamma kernel estimators and the orthog...
متن کاملOn the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
متن کاملOn Orthogonal Block Elimination
We consider the block elimination problem Q A 1 A 2 = ?C 0 , where, given a matrix A 2 R mk , A 11 2 R kk , we try to nd a matrix C with C T C = A T A and an orthogonal matrix Q that eliminates A 2. Sun and Bischof recently showed that any orthogonal matrix can be represented in the so-called basis-kernel representation Q = Q(Y; S) = I ? Y ST T. Applying this framework to the block elimination ...
متن کاملOn the Christoffel-Darboux kernel for random Hermitian matrices with external source
Bleher and Kuijlaars, and Daems and Kuijlaars showed that the correlation functions of the eigenvalues of a random matrix from unitary ensemble with external source can be expressed in terms of the ChristoffelDarboux kernel for multiple orthogonal polynomials. We obtain a representation of this Christoffel-Darboux kernel in terms of the usual orthogonal polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 16 شماره
صفحات -
تاریخ انتشار 1995